github.com/andybalholm/brotli/matchfinder.tableEntry.val (field)

51 uses

	github.com/andybalholm/brotli/matchfinder (current package)
		bargain1.go#L145: 		entry := tableEntry{offset: int32(i), val: uint32(cv)}
		bargain1.go#L166: 			if int(candidate6.offset) < i && i-int(candidate6.offset) < z.MaxDistance && uint32(cv) == candidate6.val &&
		bargain2.go#L158: 		entry := tableEntry{offset: int32(i), val: uint32(cv)}
		bargain2.go#L182: 			if int(candidate5.offset) < i && i-int(candidate5.offset) < z.MaxDistance && uint32(cv) == candidate5.val &&
		bargain2.go#L198: 			if int(candidate8.offset) < i && i-int(candidate8.offset) < z.MaxDistance && uint32(cv) == candidate8.val &&
		bargain3.go#L167: 		entry := tableEntry{offset: int32(i), val: uint32(cv)}
		bargain3.go#L192: 			if int(candidate5.offset) < i && i-int(candidate5.offset) < z.MaxDistance && uint32(cv) == candidate5.val &&
		bargain3.go#L208: 			if int(candidate8.offset) < i && i-int(candidate8.offset) < z.MaxDistance && uint32(cv) == candidate8.val &&
		bargain3.go#L224: 			if int(candidate12.offset) < i && i-int(candidate12.offset) < z.MaxDistance && uint32(cv) == candidate12.val &&
		trio.go#L103: 			entry := tableEntry{offset: s, val: uint32(cv)}
		trio.go#L122: 			if candidate12.offset < s && s-candidate12.offset < int32(z.MaxDistance) && uint32(cv) == candidate12.val &&
		trio.go#L129: 			if candidate8.offset < s && s-candidate8.offset < int32(z.MaxDistance) && uint32(cv) == candidate8.val &&
		trio.go#L135: 			if candidate5.offset < s && s-candidate5.offset < int32(z.MaxDistance) && uint32(cv) == candidate5.val &&
		trio.go#L160: 			entry := tableEntry{offset: s + 1, val: uint32(cv)}
		trio.go#L163: 			if candidate12.offset < s+1 && coffset12 < int32(z.MaxDistance) && uint32(cv) == candidate12.val &&
		trio.go#L167: 			} else if hashLengthFound < 8 && candidate8.offset < s+1 && coffset8 < int32(z.MaxDistance) && uint32(cv) == candidate8.val &&
		trio.go#L192: 				te0 := tableEntry{offset: index0, val: uint32(cv0)}
		trio.go#L208: 			entry := tableEntry{offset: s, val: uint32(cv)}
		trio.go#L214: 			if candidate12.offset < s && s-candidate12.offset < int32(z.MaxDistance) && uint32(cv) == candidate12.val &&
		trio.go#L218: 			} else if candidate8.offset < s && s-candidate8.offset < int32(z.MaxDistance) && uint32(cv) == candidate8.val &&
		trio.go#L285: 			te0 := tableEntry{offset: index0, val: uint32(cv0)}
		zdfast.go#L106: 			entry := tableEntry{offset: s + z.current, val: uint32(cv)}
		zdfast.go#L135: 			if coffsetL < int32(z.MaxDistance) && uint32(cv) == candidateL.val {
		zdfast.go#L142: 			if coffsetS < int32(z.MaxDistance) && uint32(cv) == candidateS.val {
		zdfast.go#L153: 				z.longTable[nextHashL] = tableEntry{offset: s + 1 + z.current, val: uint32(cv)}
		zdfast.go#L154: 				if coffsetL < int32(z.MaxDistance) && uint32(cv) == candidateL.val {
		zdfast.go#L204: 		te0 := tableEntry{offset: index0 + z.current, val: uint32(cv0)}
		zdfast.go#L205: 		te1 := tableEntry{offset: index1 + z.current, val: uint32(cv1)}
		zdfast.go#L212: 		te0.val = uint32(cv0)
		zdfast.go#L213: 		te1.val = uint32(cv1)
		zdfast.go#L226: 			entry := tableEntry{offset: s + z.current, val: uint32(cv)}
		zfast.go#L9: 	val    uint32
		zfast.go#L102: 			z.table[nextHash] = tableEntry{offset: s + z.current, val: uint32(cv)}
		zfast.go#L103: 			z.table[nextHash2] = tableEntry{offset: s + z.current + 1, val: uint32(cv >> 8)}
		zfast.go#L129: 			if coffset0 < int32(z.MaxDistance) && uint32(cv) == candidate.val {
		zfast.go#L136: 			if coffset1 < int32(z.MaxDistance) && uint32(cv>>8) == candidate2.val {
		zfast.go#L180: 			z.table[nextHash] = tableEntry{offset: s + z.current, val: uint32(cv)}
		zm.go#L95: 			entry := tableEntry{offset: s, val: uint32(cv)}
		zm.go#L113: 			if candidateL.offset < s && s-candidateL.offset < int32(z.MaxDistance) && uint32(cv) == candidateL.val &&
		zm.go#L119: 			if candidateS.offset < s && s-candidateS.offset < int32(z.MaxDistance) && uint32(cv) == candidateS.val &&
		zm.go#L127: 				z.longTable[nextHashL] = tableEntry{offset: s + 1, val: uint32(cv)}
		zm.go#L128: 				if candidateL.offset < s+1 && coffsetL < int32(z.MaxDistance) && uint32(cv) == candidateL.val &&
		zm.go#L154: 		te0 := tableEntry{offset: index0, val: uint32(cv0)}
		zm.go#L158: 		te0.val = uint32(cv0)
		zm.go#L176: 			entry := tableEntry{offset: s, val: uint32(cv)}
		zm.go#L181: 			if candidateL.offset < s && s-candidateL.offset < int32(z.MaxDistance) && uint32(cv) == candidateL.val &&
		zm.go#L185: 			} else if candidateS.offset < s && s-candidateS.offset < int32(z.MaxDistance) && uint32(cv) == candidateS.val &&
		zm.go#L194: 				z.longTable[nextHashL] = tableEntry{offset: s + 1, val: uint32(cv)}
		zm.go#L195: 				if candidateL.offset < s+1 && coffsetL < int32(z.MaxDistance) && uint32(cv) == candidateL.val &&
		zm.go#L263: 			te1 := tableEntry{offset: index1, val: uint32(cv1)}
		zm.go#L267: 			te1.val = uint32(cv1)